A x Grammars for Programming LanguagesC

نویسنده

  • C H A Koster
چکیده

AAx Grammars are members of the family of Two-Level Grammars, along with W-grammars, Metamorphosis Grammars and Attribute Grammars. In this tutorial we shall be concerned with the nature and rationale of AAx Grammars and their application in describing programming languages. Some parsing and aax evaluation methods for deterministic and nondeterministic AAx Grammars are discussed. By means of an example, a comparison is made with W-grammars and Attribute Grammars. Informatics is full of artiicial languages, not only many programming languages, specii-cation languages and mathematical notations, but also the user interfaces of innumerable application systems. The greater part of informatics is paper work: the description and realization of the gments of the programmer's mind. The price of invention is description: what has been invented must be described, so that it can be communicated to others. All those artiicial languages need some description, be it informal or formal. The sixties of this century were an era of rapid development of algorithmic languages. The beginning and end of this period were marked by algol 60 23] and algol 68 30], respectively. Both languages were developed by a group of scientists as a lingua franca, to get away from the machine-oriented and vendor-oriented languages of the day. Both languages, by the formality of their description, set a new standard of precision. Both were accepted with mixed feelings 6], most readers nding their description far too complicated for ordinary programmers. The deenition of a programming language serves diierent (and rather contradictory) purposes: It serves as reference material for the more serious users of the language. To that end it has to have great expositionary and didactic value for human readers. A great language deenition is a literary work of art. It should enable specialists to answer questions about the language without having to take recourse to its compiler. To that end, it will have to describe the syntax and semantics of the language in a very precise way. Although it is possible to be very precise in unformalized prose, this will imply in general that the description has to be formal. Visiting the Technical University of Budapest on a tempus-grant.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Programming Languages: A Comparative Study

In this paper we present a survey on programming languagesC++, Perl, Lisp and java. Our survey work involves a comparative study of these programming languages with respect to the following parameters like: Reusability, Portability, Reliability, Readability, Efficiency, Availability of compilers and tools, Familiarity and Expressiveness. At the end, a study of these languages has been made by c...

متن کامل

Parallel Parsing of Languages Generated by Ambiguous Bounded Context Grammars

Using the CRCW PRAM model, we describe a language recognition algorithm for an arbitrary grammar in the class of BCPP grammars 9]. (BCPP grammars, which admit ambiguity, are a generalization of both the NTS grammars 14] and Floyd's bounded context (BC) grammars 4].) Using n processors, the algorithm runs in time O(h log n) (O(h) in the case of an unambiguous grammar), where n is the length of t...

متن کامل

Application of Attribute NCE Graph Grammars to Syntactic Editing of Tabular Forms

In this paper, we deal with editing tabular forms for program specifications based on a particular graph grammar HNGG [2]. First, we formalize syntax-directed editing methods by extending of the notion of the Cornell Program Synthesizer [8] to attribute NCE graph grammars (cf. [1]). Next, we discuss the algorithms of the editing methods. keyword Graph Grammars, Visual Programming, Software Deve...

متن کامل

The family of A x Grammars

This note describes the rationale behind AAx Grammars. AAx Grammars are a class of two-level grammars, Context-Free grammars extended with features and operations. Originally invented for the description of natural languages, various forms of AAx Grammars have found numerous applications in Computer Science, and eecient implementations were made. In the last years AAx Grammars with set-valued a...

متن کامل

A Framework For Tree-Adjunct Grammar Guided Genetic Programming

In this paper we propose the framework for a grammar-guided genetic programming system called Tree-Adjunct Grammar Guided Genetic Programming (TAGGGP). Some intuitively promising aspects of the model compared with other grammar-guided evolutionary methods are also highlighted. 1 Introduction Genetic programming (GP) is considered to be a machine learning method, which induces a population of co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991